A Disk-Packing Algorithm for an Origami Magic Trick
نویسندگان
چکیده
We present an algorithm for a magic trick. Given a polygon with holesP , our algorithm determines a folding of a rectangular sheet of paper such that a single straight cut suffices to cut out P .
منابع مشابه
Packing and deploying Soft Origami to and from cylindrical volumes with application to automotive airbags
Packing soft-sheet materials of approximately zero bending stiffness using Soft Origami (origami patterns applied to soft-sheet materials) into cylindrical volumes and their deployment via mechanisms or internal pressure (inflation) is of interest in fields including automobile airbags, deployable heart stents, inflatable space habitats, and dirigible and parachute packing. This paper explores ...
متن کاملA Reed–Solomon Code Magic Trick
Richard Ehrenborg [1] has provided a nice magic trick that can be used to illustrate many properties of Hamming codes. His paper includes a set of manipulatives that can be used to implement the trick. An improved version of this Hamming code magic trick is described in a recent paper in Math Horizons [3]. In this paper, we introduce a similar magic trick that is based on a Reed–Solomon code. I...
متن کاملA Dual Band Frequency Reconfigurable Origami Magic Cube Antenna for Wireless Sensor Network Applications
In this paper, a novel dual band frequency reconfigurable antenna using an origami magic cube is proposed for wireless sensor network (WSN) applications. The proposed origami antenna consists of a meandered monopole folded onto three sides of the magic cube. A microstrip open-ended stub is loaded on the meandered monopole. The proposed origami magic cube can be mechanically folded and unfolded....
متن کاملApproximation Algorithms for Geometric Covering Problems for Disks and Squares
Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue UnitSquare Cover. In the Disjoint Unit-Disk Cover problem, we are given a point set and want to cover the maximum number of points using disjoint unit disks. We prove that the problem is NP-complete and give a polynomial-time approxim...
متن کاملIt's a kind of magic—what self-reports can reveal about the phenomenology of insight problem solving
Magic tricks usually remain a mystery to the observer. For the sake of science, we offered participants the opportunity to discover the magician's secret method by repeatedly presenting the same trick and asking them to find out how the trick worked. In the context of insightful problem solving, the present work investigated the emotions that participants experience upon solving a magic trick. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998